Extending Two Fixpoint Theorems of Langley and Zheng
نویسنده
چکیده
We extend two theorems on fixpoints of f(z) by Langley and Zheng [1] to the consideration of points where f(z) = Q(z) for some rational function Q such that Q(∞) =∞. In addition, we extend the class of functions f from transcendental entire functions to meromorphic functions with relatively few poles. Mathematics Subject Classification (1991): 30D30, 30D35
منابع مشابه
Reconciliation of Elementary Order and Metric Fixpoint Theorems
We prove two new fixed point theorems for generalized metric spaces and show that various fundamental fixed point principles, including: Banach Contraction Principle, Caristi fixed point theorem for metric spaces, Knaster-Tarski fixed point theorem for complete lattices, and the Bourbaki-Witt fixed point theorem for directed-complete orders, follow as corollaries of our results.
متن کاملFlat modal fixpoint logics with the converse modality
We prove a generic completeness result for a class of modal fixpoint logics corresponding to flat fragments of the two-way mu-calculus, extending earlier work by Santocanale and Venema. We observe that Santocanale and Venema’s proof that least fixpoints in the Lindenbaum-Tarski algebra of certain flat fixpoint logics are constructive, using finitary adjoints, no longer works when the converse m...
متن کاملFO(FD): Extending classical logic with rule-based fixpoint definitions
We introduce fixpoint definitions, a rule-based reformulation of fixpoint constructs. The logic FO(FD), an extension of classical logic with fixpoint definitions, is defined. We illustrate the relation between FO(FD) and FO(ID), which is developed as an integration of two knowledge representation paradigms. The satisfiability problem for FO(FD) is investigated by first reducing FO(FD) to differ...
متن کاملSet Constraints in Logic Programming
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form 〈X,F〉 where X is a finite set of propositional atoms and F is an arbitrary family of subsets of X. We call such atoms set constaints and show that the concept of stable model can be generalized to programs admitting set constraints b...
متن کاملGames for Logic and Concurrency
4 Literature review 8 4.1 Modal and Temporal Logics . . . . . . . . . . . . . . . . . . . . . . . . . . 8 4.2 Games for Modal and Temporal Logics . . . . . . . . . . . . . . . . . . . . 9 4.3 Models of Concurrency . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 4.4 Games for Models of Concurrency . . . . . . . . . . . . . . . . . . . . . . 10 4.5 Lattices and Complete lattices . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005